Timing Verification by Successive Approximation
نویسندگان
چکیده
منابع مشابه
Parsing by Successive Approximation
It is proposed to parse feature structure-based grammars in several steps. Each step is aimed to eliminate as many invalid analyses as possible as e ciently as possible. To this end the set of feature constraints is divided into three subsets, a set of context-free constraints, a set of ltering constraints and a set of structure-building constraints, which are solved in that order. The best pro...
متن کاملDeinterlacing by successive approximation
We propose an algorithm for deinterlacing of interlaced video sequences. It successively builds approximations to the deinterlaced sequence by weighting various interpolation methods. A particular example given here uses four interpolation methods, weighted according to the errors each one introduces. Due to weighting, it is an adaptive algorithm. It is also time-recursive, since the motion-com...
متن کاملUnconstrained Derivative-Free Optimization by Successive Approximation
We present an algorithmic framework for unconstrained derivative-free optimization based on dividing the search space in regions (partitions). Every partition is assigned a representative point. The representative points form a grid. A piece-wise constant approximation to the function subject to optimization is constructed using a partitioning and its corresponding grid. The convergence of the ...
متن کاملsignal specific successive approximation analog to digital converter
چکیده: در میان انواع متفاوتی از مبدل های آنالوگ به دیجیتال که تا کنون معرفی شده اند، مبدل های آنالوگ به دیجیتال تقاریب متوالی(sar ) به علت سادگی ساختار و همچنین توان مصرفی کم، همواره یکی از پرکاربرد ترین مبدل های آنالوگ به دیحیتال در کاربرد های بایومدیکال بوده اند. به همین دلیل تاکنون روش های متعددی برای کاهش هرچه بیشتر توان مصرفی در این مبدل ها ارائه شده است که در اکثر آنها توجهی به مشخصات سی...
15 صفحه اولSuccessive Collocation : An Approximation to
A novel approach to solving the optimal nonlin-ear control problem is presented. Instead of seeking a global approximation to the Hamilton-Jacobi-Bellman equation, a local approximation is obtained by successively solving the Generalized Hamilton-Jacobi-Bellman (GHJB) equation on a local region of the state space. The optimal control is generated by solving the GHJB equation algebraically at se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1995
ISSN: 0890-5401
DOI: 10.1006/inco.1995.1059